Convergence to the fixed-node limit in deep variational Monte Carlo

نویسندگان

چکیده

Variational quantum Monte Carlo (QMC) is an ab-initio method for solving the electronic Schr\"odinger equation that exact in principle, but limited by flexibility of available ansatzes practice. The recently introduced deep QMC approach, specifically two deep-neural-network PauliNet and FermiNet, allows variational to reach accuracy diffusion QMC, little understood about convergence behavior such ansatzes. Here, we analyze how approaches fixed-node limit with increasing network size. First, demonstrate a neural can overcome limitations small basis set mean-field complete-basis-set limit. Moving electron correlation, then perform extensive hyperparameter scan Jastrow factor LiH H$_4$ find energies at be obtained sufficiently large network. Finally, benchmark many-body on H$_2$O, fraction recovered correlation energy single-determinant Slater--Jastrow-type half order magnitude compared previous results Slater--Jastrow--backflow version ansatz overcomes limitations. This analysis helps understanding superb comparison traditional trial wavefunctions respective level theory, will guide future improvements architectures QMC.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variational Sequential Monte Carlo

Many recent advances in large scale probabilistic inference rely on variational methods. The success of variational approaches depends on (i) formulating a flexible parametric family of distributions, and (ii) optimizing the parameters to find the member of this family that most closely approximates the exact posterior. In this paper we present a new approximating family of distributions, the v...

متن کامل

Variational Consensus Monte Carlo

Practitioners of Bayesian statistics have long depended on Markov chain Monte Carlo (MCMC) to obtain samples from intractable posterior distributions. Unfortunately, MCMC algorithms are typically serial, and do not scale to the large datasets typical of modern machine learning. The recently proposed consensus Monte Carlo algorithm removes this limitation by partitioning the data and drawing sam...

متن کامل

Delayed rejection variational Monte Carlo.

An acceleration algorithm to address the problem of multiple time scales in variational Monte Carlo simulations is presented. After a first attempted move has been rejected, the delayed rejection algorithm attempts a second move with a smaller time step, so that even moves of the core electrons can be accepted. Results on Be and Ne atoms as test cases are presented. Correlation time and both av...

متن کامل

Convergence of Monte Carlo simulations to equilibrium.

We give two direct, elementary proofs that a Monte Carlo simulation converges to equilibrium provided that appropriate conditions are satisfied. The first proof requires detailed balance while the second is quite general.

متن کامل

Variational method for estimating the rate of convergence of Markov-chain Monte Carlo algorithms.

We demonstrate the use of a variational method to determine a quantitative lower bound on the rate of convergence of Markov chain Monte Carlo (MCMC) algorithms as a function of the target density and proposal density. The bound relies on approximating the second largest eigenvalue in the spectrum of the MCMC operator using a variational principle and the approach is applicable to problems with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemical Physics

سال: 2021

ISSN: ['1520-9032', '1089-7690', '0021-9606']

DOI: https://doi.org/10.1063/5.0032836